A total, ground path ordering for proving termination of AC-rewrite systems
Identifieur interne : 00BC82 ( Main/Exploration ); précédent : 00BC81; suivant : 00BC83A total, ground path ordering for proving termination of AC-rewrite systems
Auteurs : Deepak Kapur [États-Unis] ; G. Sivakumar [Inde]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: A new path ordering for showing termination of associative-commutative (AC) rewrite systems is defined. If the precedence relation on function symbols is total, the ordering is total on ground terms, but unlike the ordering proposed by Rubio and Nieuwenhuis, this ordering can orient the distributivity property in the proper direction. The ordering is defined in a natural way using recursive path ordering with status as the underlying basis. This settles a longstanding problem in termination orderings for AC rewrite systems. The ordering can be used to define an ordering on nonground terms.
Url:
DOI: 10.1007/3-540-62950-5_67
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002050
- to stream Istex, to step Curation: 002024
- to stream Istex, to step Checkpoint: 002815
- to stream Main, to step Merge: 00C460
- to stream Main, to step Curation: 00BC82
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A total, ground path ordering for proving termination of AC-rewrite systems</title><author><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name></author><author><name sortKey="Sivakumar, G" sort="Sivakumar, G" uniqKey="Sivakumar G" first="G." last="Sivakumar">G. Sivakumar</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8C54B833E55EE2CC6DDD6086170B80EADD8D8165</idno><date when="1997" year="1997">1997</date><idno type="doi">10.1007/3-540-62950-5_67</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-23ZHPLPM-B/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002050</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002050</idno><idno type="wicri:Area/Istex/Curation">002024</idno><idno type="wicri:Area/Istex/Checkpoint">002815</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002815</idno><idno type="wicri:doubleKey">0302-9743:1997:Kapur D:a:total:ground</idno><idno type="wicri:Area/Main/Merge">00C460</idno><idno type="wicri:Area/Main/Curation">00BC82</idno><idno type="wicri:Area/Main/Exploration">00BC82</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A total, ground path ordering for proving termination of AC-rewrite systems</title><author><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">État de New York</region></placeName><wicri:cityArea>Department of Computer Science, State University of New York, 12222, Albany</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Sivakumar, G" sort="Sivakumar, G" uniqKey="Sivakumar G" first="G." last="Sivakumar">G. Sivakumar</name><affiliation wicri:level="1"><country xml:lang="fr">Inde</country><wicri:regionArea>Computer Science Department, Indian Institute of Technology, Bombay</wicri:regionArea><wicri:noRegion>Bombay</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Inde</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A new path ordering for showing termination of associative-commutative (AC) rewrite systems is defined. If the precedence relation on function symbols is total, the ordering is total on ground terms, but unlike the ordering proposed by Rubio and Nieuwenhuis, this ordering can orient the distributivity property in the proper direction. The ordering is defined in a natural way using recursive path ordering with status as the underlying basis. This settles a longstanding problem in termination orderings for AC rewrite systems. The ordering can be used to define an ordering on nonground terms.</div></front></TEI><affiliations><list><country><li>Inde</li><li>États-Unis</li></country><region><li>État de New York</li></region></list><tree><country name="États-Unis"><region name="État de New York"><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name></region><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name></country><country name="Inde"><noRegion><name sortKey="Sivakumar, G" sort="Sivakumar, G" uniqKey="Sivakumar G" first="G." last="Sivakumar">G. Sivakumar</name></noRegion><name sortKey="Sivakumar, G" sort="Sivakumar, G" uniqKey="Sivakumar G" first="G." last="Sivakumar">G. Sivakumar</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00BC82 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00BC82 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:8C54B833E55EE2CC6DDD6086170B80EADD8D8165
|texte= A total, ground path ordering for proving termination of AC-rewrite systems
}}
| This area was generated with Dilib version V0.6.33. |  |